Egalitarian Peer-to-Peer Satellite Refueling Strategy
نویسندگان
چکیده
bi = supply/demand corresponding to a node in Vn C M = cost of an egalitarian peer-to-peer solution M CLB = optimal value of objective function of the optimization problem cij = cost of an edge in Gn cij = cost of an edge in G‘ c i; j; k = cost of a triplet i; j; k representing an egalitarian peer-to-peer maneuver d = distance between two triplets tp and tq E‘ = set of edges in G‘ Ef = set of edges in Gn representing forward trips of active satellites En = set of edges in Gn Er = set of edges in Gn representing return trips of active satellites Es = set of source arcs in Gn Et = set of sink arcs in Gn fi = maximum fuel capacity of satellite si f i = minimum fuel requirement by satellite si to remain operational fi;t = fuel content of satellite si at time t G = constellation digraph G‘ = bipartite graph used for calculating lower bound on cost of optimal e-p2p solution Gn = constellation network g0 = acceleration due to gravity at surface of the earth Isp = specific thrust of satellite s J = index set for satellites/orbital slots J a = index set for orbital slots of active satellites J p = index set for orbital slots of passive satellites J r = index set of orbital slots available for active satellites to return J d;t = index set for orbital slots of fuel-deficient satellites at time t J s;t = index set for orbital slots of fuel-sufficient satellites at time t M = egalitarian peer-to-peer solution composed of a set of triplets M = optimal egalitarian peer-to-peer solution MH = egalitarian peer-to-peer solution obtained after local search onMIP MIP = Egalitarian peer-to-peer solution yield by the optimization problem MP2P = optimal egalitarian peer-to-peer solution ms = mass of permanent structure of satellite s N2 tp; tq = two-exchange neighborhood of a triplet pair comprising tp and tq N M = neighborhood of an egalitarian peer-to-peer solution M p ij = fuel expenditure required for an orbital transfer by satellite s from slot i to slot j Q i; j; k = edge in E‘ corresponding to a triplet i; j; k si = satellite with index i 2 J T = total time allotted for refueling T = set of feasible triplets in the constellation graph tp = triplet ip; jp; kp with index p Vn = set of vertices in Gn xij = binary variable corresponding to an arc i; j 2 En or an edge hi; ji in E‘ Vij = velocity change required for a transfer from slot i to slot j = suboptimality measure
منابع مشابه
Peer-to-Peer Refueling for Circular Satellite Constellations
In this paper, we study the scheduling problem arising from refueling multiple satellites in a circular constellation. It is assumed that there is no fuel delivered to the constellation from an external source. Instead, all satellites in the constellation are assumed to be capable of refueling each other (peer-to-peer refueling). The total time to complete the rendezvous maneuvers including the...
متن کاملAas 07-150 a Greedy Random Adaptive Search Procedure for Optimal Scheduling of P2p Satellite Refueling
All studies of peer-to-peer (henceforth abbreviated as P2P) satellite refueling so far assume that all active satellites return back to their original orbital positions after undergoing fuel exchanges with the passive satellites. In this paper, we remove this restriction on the active satellites, namely, we allow the active satellites to interchange orbital slots during the return trips. We for...
متن کاملAas 05-474 Asynchronous Optimal Mixed P2p Satellite Refueling Strategies
In this paper, we study pure peer-to-peer (henceforth abbreviated as P2P) and mixed (combined single-spacecraft and P2P) satellite refueling in circular orbit constellations comprised of multiple satellites. We consider the optimization of two conflicting objectives in the refueling problem and show that the cost function we choose to determine the optimal refueling schedule reflects a reasonab...
متن کاملA Cooperative P2p Refueling Strategy for Circular Satellite Constellations
In this paper, we discuss the problem of peer-to-peer (P2P) refueling of satellites in a circular constellation. In particular, we propose a cooperative P2P (C-P2P) refueling strategy, in which the satellites involved in P2P maneuvers are allowed to engage in cooperative rendezvous. We discuss a formulation of the proposed C-P2P strategy and a methodology to determine the optimal C-P2P assignme...
متن کاملAn Auction Algorithm for Optimal Satellite Refueling
Satellite refueling can extend the lifetime of satellite constellations. Peer-to-peer satellite refueling in particular has the potential to make the most efficient use of the fuel contained in the constellation by redistributing it as on a need-to basis. In this paper we present an alternative implementation of P2P refueling, namely pairing up fuel sufficient satellites with fuel deficient sat...
متن کامل